Extremal values of the interval number of a graph, II

The interval number i(G) of a simple graph G is the smallest number such that to each vertex in G there can be assigned a collection of at most finite closed intervals on the real line so that there is an edge between vertices v and w in G if and only if some interval for v intersects some interval for w. The well known interval graphs are precisely those graphs G with i(G)=<I. We prove here that for any graph G with maximum degree d, i(G) <-[1/2(d + 1)]. This bound is attained by every regular graph of degree d with no triangles, so is best possible. The degree bound is applied to show that i(G) <-[1/2n] for graphs on n vertices and i(G)<-[/J for graphs with e edges.